Finding Enclosures for Linear Systems Using Interval Matrix Multiplication in CUDA
نویسندگان
چکیده
In this paper we present CUDA kernels that compute an interval matrix product. Starting from a naive implementation we investigate possible speedups using commonly known techniques from standard matrix multiplication. We also evaluate the achieved speedup when our kernels are used to accelerate a variant of an existing algorithm that finds an enclosure for the solution of a linear system. Moreover the quality of our enclosure is discussed.
منابع مشابه
On Benchmarking the Matrix Multiplication Algorithm using OpenMP, MPI and CUDA Programming Languages
Parallel programming languages represent a common theme in the evolution of high performance computing (HPC) systems. There are several parallel programming languages that are directly associated with different HPC systems. In this paper, we compare the performance of three commonly used parallel programming languages, namely: OpenMP, MPI and CUDA. Our performance evaluation of these languages ...
متن کاملAn Accurate an Efficient Selfverifying Solver for Systems with Banded Coefficient Matrix
In this paper we discuss a selfverifying solver for systems of linear equations Ax = b with banded matrices A and the future adaptation of the algorithms to cluster computers. We present an implementation of an algorithm to compute efficiently componentwise good enclosures for the solution of a sparse linear system on typical cluster computers. Our implementation works with point as well as int...
متن کاملDealing with performance/portability and performance/accuracy trade-offs in heterogeneous computing systems: A case study with matrix multiplication modulo primes
We present the study of two important trade-offs in heterogeneous systems (i.e., between performance versus portability and between performance and accuracy) for a relevant linear algebra problem, matrix multiplication modulo primes. Integer matrix linear algebra methods rely heavily on matrix multiplication modulo primes. Double precision is necessary for exact representation of sufficiently m...
متن کاملSolutions of Fuzzy Linear Systems using Ranking function
In this work, we propose an approach for computing the compromised solution of an LR fuzzy linear system by using of a ranking function when the coefficient matrix is a crisp mn matrix. To do this, we use expected interval to find an LR fuzzy vector, X , such that the vector (AX ) has the least distance from (b) in 1 norm and the 1 cut of X satisfies the crisp linear system AX = b ...
متن کاملComputing Best Possible Pseudo-Solutions to Interval Linear Systems of Equations
In the paper, we consider interval linear algebraic systems of equations Ax = b, with an interval matrix A and interval right-hand side vector b, as a model of imprecise systems of linear algebraic equations of the same form. We propose a new regularization procedure that reduces the solution of the imprecise linear system to computing a point from the tolerable solution set for the interval li...
متن کامل